An Accurate and Easy to Interpret Binary Classifier Based on Association Rules Using Implication Intensity and Majority Vote

نویسندگان

چکیده

In supervised learning, classifiers range from simpler, more interpretable and generally less accurate ones (e.g., CART, C4.5, J48) to complex, neural networks, SVM). this tradeoff between interpretability accuracy, we propose a new classifier based on association rules, that is say, both easy interpret leading relevant accuracy. To illustrate proposal, its performance compared other widely used methods six open access datasets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building an Associative Classifier Based on Fuzzy Association Rules

Classification based on association rules is considered to be effective and advantageous in many cases. However, there is a so-called "sharp boundary" problem in association rules mining with quantitative attribute domains. This paper aims at proposing an associative classification approach, namely Classification with Fuzzy Association Rules (CFAR), where fuzzy logic is used in partitioning the...

متن کامل

turkish-israeli relations and their implication on iranian national security

this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...

15 صفحه اول

Majority Vote Based on Weak Classifiers

We present a two-class pattern recognition method through the majority vote which is based on weak classifiers. The weak classifiers are defined‘in terms of rectangular regions formed by the original training data. Tests on real and simulated data sets show that this classifier combination procedure can lead to a high accuracy.

متن کامل

An Algorithm of Constrained Spatial Association Rules Based on Binary

An algorithm of constrained association rules mining was presented in order to search for some items expected by people. Since some presented algorithms of association rules mining based on binary are complicated to generate frequent candidate itemsets, they may pay out heavy cost when these algorithms are used to extract constrained spatial association rules. And so this paper proposes an algo...

متن کامل

PAC-Bayesian Majority Vote for Late Classifier Fusion

A lot of attention has been devoted to multimedia indexing over the past few years. In the literature, we often consider two kinds of fusion schemes: The early fusion and the late fusion. In this paper we focus on late classifier fusion, where one combines the scores of each modality at the decision level. To tackle this problem, we investigate a recent and elegant well-founded quadratic progra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9121315